A Branch-and-Bound Algorithm for Team Formation on Social Networks

This paper presents an exact algorithm for the team formation problem, in which aim is, given a project and its required skills, to construct capable that can communicate collaborate effectively. combinatorial optimization problem is modeled as quadratic set covering problem. The study provides novel branch-and-bound where reformulation of relaxed so it decomposes into series linear problems, constraints are imposed through branching. able solve instances intractable commercial solvers. illustrates efficient usage algorithmic methods modeling techniques operations research It contributes field computational by proposing new application version classical